Clustering of solutions in hard satisfiability problems
نویسندگان
چکیده
منابع مشابه
Generating Hard Satisfiability Problems
We report results from large-scale experiments in satisfiability testing. As has been observed by others, testing the satisfiability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible to generate random formulas that are hard, that is, for which satisfiability testing is quite diffi...
متن کاملA NN Algorithm for Hard Satisfiability Problems†
Satisfiability (SAT) refers to the task of finding a truth assignment that makes an arbitrary boolean expression true. For example, the boolean expression a & b is true iff the boolean variables a and b are true. Satisfiability is of interest to the logic, operations research, and computational complexity communities. Due to the emphasis of the logic community, traditional satisfiability algori...
متن کاملSimulated annealing for hard satisfiability problems
Satisfiability (SAT) refers to the task of finding a truth assignment that makes an arbitrary boolean expression true. This paper compares a simulated annealing algorithm (SASAT) with GSAT (Selman et al., 1992), a greedy algorithm for solving satisfiability problems. GSAT can solve problem instances that are extremely difficult for traditional satisfiability algorithms. Results suggest that SAS...
متن کاملSolving “Hard” Satisfiability Problems Using GridSAT
We present the latest instantiation of GridSAT [5], a distributed and complete satisfiability solver that is explicitly designed to aggregate grid resources for application performance. GridSAT was previously shown to outperform the state-of-the-art sequential solvers. In this work, we explore the unprecedented solving power GridSAT enables through algorithmic and implementation innovations. We...
متن کاملSolving and Sampling with Many Solutions: Satisfiability and Other Hard Problems
We investigate parameterizing hard combinatorial problems by the size of the solution set compared to all solution candidates. Our main result is a uniform sampling algorithm for satisfying assignments of 2-CNF formulas that runs in expected time O∗(ε−0.617) where ε is the fraction of assignments that are satisfying. This improves significantly over the trivial sampling bound of expected Θ∗(ε−1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2007
ISSN: 1742-5468
DOI: 10.1088/1742-5468/2007/10/p10012